A polynomial double reversal minimization algorithm for deterministic finite automata
نویسندگان
چکیده
منابع مشابه
A polynomial double reversal minimization algorithm for deterministic finite automata
We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity. © 2013 Elsevier B.V. All rights reserved.
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملEfficient Implementation for Deterministic Finite Tree Automata Minimization
We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized. We show that the asymptotic complexity of the standard implementation is linearithmic and the incremental one is O(n3 log(n)) where n is the DFT...
متن کاملA Practical Algorithm for Reducing Non- deterministic Finite State Automata
In [3], Ilie and Yu describe a construction of a right-invariant equivalence relation on the states of a non-deterministic finite-state automaton. We give a more efficient algorithm for constructing the same equivalence, together with results from a computer implementation.
متن کاملA Parallel Algorithm for Minimization of Finite Automata
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5 using data parallel and message passing models. We show that its time complexity on a p processor EREW PRAM (p n) for inputs of size n is O( log 2 n p + log n log p) uniformly on almost all instances. The work done by our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.03.005